Range Medians
نویسندگان
چکیده
We study a generalization of the classical median finding problem to batched query case: given an array of unsorted n items and k intervals in the array, the goal is to determine the median in each of the intervals in the array. We give an algorithm that uses O(n log k) comparisons and show a matching lower bound of Ω(n log k) comparisons for this problem.
منابع مشابه
Antegrade intramedullary pinning versus retrograde intramedullary pinning for displaced fifth metacarpal neck fractures.
BACKGROUND Severe angulation or shortening can be a surgical indication for fifth metacarpal neck fracture. In a previous meta-analysis, antegrade intramedullary pinning was shown to produce better hand function outcomes than percutaneous transverse pinning or miniplate fixation for treatment of fifth metacarpal neck fractures. However, the outcomes of retrograde intramedullary pinning, to our ...
متن کاملNonparametric estimation of conditional medians for linear and related processes
We consider nonparametric estimation of conditional medians for time series data. The time series data are generated from two mutually independent linear processes. The linear processes may show long-range dependence. The estimator of the conditional medians is based on minimizing the locally weighted sum of absolute deviations for local linear regression. We present the asymptotic distribution...
متن کاملSelf-management of oral anticoagulation in the elderly: rationale, design, baselines and oral anticoagulation control after one year of follow-up. A randomized controlled trial.
Self-management is safe and reliable in patients with long-term oral anticoagulation (OAC). However, no study has yet assessed the safety and efficacy of OAC self-management in elderly patients with major thromboembolic and haemorrhagic complications as primary outcomes. In this multi-centre, open, randomised controlled trial, patients aged 60 years or more were randomised into the self-managem...
متن کاملUnderstanding the K-Medians Problem
In this study, the general ideas surrounding the k-medians problem are discussed. This involves a look into what k-medians attempts to solve and how it goes about doing so. We take a look at why k-medians is used as opposed to its k-means counterpart, specifically how its robustness enables it to be far more resistant to outliers. We then discuss the areas of study that are prevalent in the rea...
متن کاملOptimization in Arrangements
Many problems can be formulated as the optimization of functions in R which are implicitly defined by an arrangement of lines, halfplanes, or points, for example linear programming in the plane. We present an efficient general approach to find the optimum exactly, for a wide range of functions that possess certain useful properties. To illustrate the value of this approach, we give a variety of...
متن کامل